翻訳と辞書 Words near each other ・ Graph literacy ・ Graph manifold ・ Graph minor ・ Graph Modelling Language ・ Graph Nobel ・ Graph of a function ・ Graph of desire ・ Graph of groups ・ Graph operations ・ Graph paper ・ Graph partition ・ Graph pax ・ Graph pebbling ・ Graph power ・ Graph product ・ Graph property ・ Graph realization problem ・ Graph reduction ・ Graph reduction machine ・ Graph rewriting ・ Graph sandwich problem ・ Graph state ・ Graph structure theorem ・ Graph Style Sheets ・ Graph theory ・ Graph theory in enzymatic kinetics ・ Graph toughness ・ Graph traversal ・ Graph-based access control ・ GRaPH-Int Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Graph property ： ウィキペディア英語版 Graph property In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations such as particular labellings or drawings of the graph.〔.〕 ==Definitions== While graph drawing and graph representation are valid topics in graph theory, in order to focus only on the abstract structure of graphs, a graph property is defined to be a property preserved under all possible isomorphisms of a graph. In other words, it is a property of the graph itself, not of a specific drawing or representation of the graph. Informally, the term "graph invariant" is used for properties expressed quantitatively, while "property" usually refers to descriptive characterizations of graphs. For example, the statement "graph does not have vertices of degree 1" is a "property" while "the number of vertices of degree 1 in a graph" is an "invariant". More formally, a graph property is a class of graphs with the property that any two isomorphic graphs either both belong to the class, or both do not belong to it.〔 Equivalently, a graph property may be formalized using the indicator function of the class, a function from graphs to Boolean values that is true for graphs in the class and false otherwise; again, any two isomorphic graphs must have the same function value as each other. A graph invariant or graph parameter may similarly be formalized as a function from graphs to a broader class of values, such as integers, real numbers, sequences of numbers, or polynomials, that again has the same value for any two isomorphic graphs.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Graph property」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.